Modified Min Sum Decoding Algorithm for Low Density Parity Check Codes
نویسندگان
چکیده
منابع مشابه
Improved Layered Min-Sum Decoding Algorithm for Low Density Parity Check Codes
In this paper, an improved layered min-sum (ILMS) algorithm is proposed for the decoding of lowdensity parity-check (LDPC) codes. The proposed method speeds up the decoding by slightly amplifying the message update from check node to variable node. Simulations and analytical results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce the numbe...
متن کاملOptimized Min-Sum Decoding Algorithm for Low Density Parity Check Codes
Low Density Parity Check (LDPC) code approaches Shannon–limit performance for binary field and long code lengths. However, performance of binary LDPC code is degraded when the code word length is small. An optimized minsum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods, an optimization factor has been introduced in both check node and bit node...
متن کاملModified Multi-bit Flipping Decoding Algorithm for Low-density Parity-check Codes
Aiming at seeking a low complexity decoder of the low-density parity-check (LDPC) codes, we present one modified multi-bit flipping (MMBF) algorithm. For those LDPC codes whose parity check matrices have light column weight, both the bootstrap step and a novel delay-handling step are included in MMBF, based on one framework which is the combination of conventional PWBF and IWBF. On the other ha...
متن کاملEarly Decision Decoding Methods for Low-Density Parity-Check Codes
Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate a modification to the dec...
متن کاملGaussian Approximation for Sum-Product Decoding of Low-Density Parity-Check Codes
We use a Gaussian approximation (GA) for analyzing the sum-product algorithm for lowdensity parity-check (LDPC) codes and memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels. This simplification allows us to calculate the threshold quickly and to understand the behavior of the decoder better. We have also designed high rate LDPC codes using the GA that have t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.04.230